Ranking participants in generalized tournaments
نویسندگان
چکیده
منابع مشابه
Ranking participants in generalized tournaments
Consider the problem of ranking social alternatives based on the number of voters that prefer one alternative to the other. Or consider the problem of ranking chess players by their past performance. A wide variety of ranking methods have been proposed to deal with these problems. Using six independent axioms, we characterize the fair-bets ranking method proposed by Daniels [4] and Moon and Pul...
متن کاملRanking Tournaments
A tournament is an oriented complete graph. The feedback arc set problem for tournaments is the optimization problem of determining the minimum possible number of edges of a given input tournament T whose reversal makes T acyclic. Ailon, Charikar and Newman showed that this problem is NP-hard under randomized reductions. Here we show that it is in fact NP-hard. This settles a conjecture of Bang...
متن کاملOn Generalized Exponents of Tournaments
We determine two types of generalized exponent sets for tournaments with given order. In the course of proving the main results we find the following result, which may be interesting in its own right: When n is large enough, almost all tournaments on n vertices have the property that there is a path of length 2 from each vertex u to each vertex v 6= u.
متن کاملRealization of certain generalized paths in tournaments
A tournament T,, consists of a set of n vertices and a single directed edge joining every pair of distinct vertices. We denote the vertices of T’. by {l, . . . , n). A permutation aI, . . . , a, of the vertices is a generalized path. The type af the path is characterized by the sequence a,_1 = e3 l l l E~__~ where si = i-1 if e -+ ai+1 and 6 = -1 if a, -+ ai tl. We also say that mn_l is realize...
متن کاملRestricted arc-connectivity of generalized tournaments
If D is a strongly connected digraph, then an arc set S of D is called a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc. Recently, Volkmann [12] defined the restricted arc-connectivity λ(D) as the minimum cardinality over all restricted arc-cuts S. A strongly connected digraph D is called λconnected when λ(D) exists. Let k ≥ 2 be an i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Game Theory
سال: 2005
ISSN: 0020-7276,1432-1270
DOI: 10.1007/s00182-005-0197-5